The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(O(1), O(1)).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

a(a(b(x1))) → b(c(b(a(a(a(x1))))))
a(c(x1)) → b(x1)

Rewrite Strategy: INNERMOST

(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)

Converted CpxTRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

a(a(b(z0))) → b(c(b(a(a(a(z0))))))
a(c(z0)) → b(z0)

Tuples:

A(a(b(z0))) → c1(A(a(a(z0))), A(a(z0)), A(z0))

S tuples:

A(a(b(z0))) → c1(A(a(a(z0))), A(a(z0)), A(z0))

K tuples:none
Defined Rule Symbols:

a

Defined Pair Symbols:

A

Compound Symbols:

c1

(3) CdtUnreachableProof (EQUIVALENT transformation)

The following tuples could be removed as they are not reachable from basic start terms:

A(a(b(z0))) → c1(A(a(a(z0))), A(a(z0)), A(z0))

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

a(a(b(z0))) → b(c(b(a(a(a(z0))))))
a(c(z0)) → b(z0)

Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:

a

Defined Pair Symbols:none

Compound Symbols:none

(5) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

(6) BOUNDS(O(1), O(1))